A hybrid data mining GRASP with path-relinking

نویسندگان

  • Hugo Barbalho
  • Isabel Rosseti
  • Simone L. Martins
  • Alexandre Plastino
چکیده

The exploration of hybrid metaheuristics — combination of metaheuristics with concepts and processes from other research areas — has been an important trend in combinatorial optimization research. In this work, we developed a hybrid version of the GRASP metaheuristic which incorporates the path-relinking procedure — a memory-based intensification strategy — and a data mining module. Computational experiments showed that employing the combination of path-relinking and data mining allowed GRASP to find better results in less computational time. Another contribution of this work is the application of the path-relinking hybrid proposal for the 2-path network design problem, which improved the state-of-the-art solutions for this problem.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Hybridizations of GRASP with Path-Relinking

A greedy randomized adaptive search procedure (GRASP) is a metaheuristic for combinatorial optimization. GRASP heuristics are multistart procedures which apply local search to a set of starting solutions generated with a randomized greedy algorithm or semi-greedy method. The best local optimum found over the iterations is returned as the heuristic solution. Path-relinking is a search intensific...

متن کامل

Greedy randomized adaptive search procedure with exterior path relinking for differential dispersion minimization

We propose several new hybrid heuristics for the differential dispersion problem, the best of which consists of a GRASP with sampled greedy construction with variable neighborhood search for local improvement. The heuristic maintains an elite set of high-quality solutions throughout the search. After a fixed number of GRASP iterations, exterior path relinking is applied between all pairs of eli...

متن کامل

A Hybrid Grasp with Perturbations and Adaptive Path-relinking for the Steiner Problem in Graphs

We propose and describe a hybrid GRASP with weight perturbations and adaptive path-relinking heuristic (HGP-PR) for the Steiner problem in graphs. In this multi-start approach, the greedy randomized construction phase of a GRASP is replaced by the combination of several construction heuristics with a weight perturbation strategy that combines intensification and diversification elements, as in ...

متن کامل

Grasp with Exterior Path Relinking for Differential Dispersion Minimization

We propose several new hybrid heuristics for the differential dispersion problem are proposed, the best of which consists of a GRASP with sampled greedy construction with variable neighborhood search for local improvement. The heuristic maintains an elite set of high-quality solutions throughout the search. After a fixed number of GRASP iterations, exterior path relinking is applied between all...

متن کامل

Hybrid GRASP with Composite Local Search And Path-Relinking for the Linear Ordering Problem with Cumulative Costs

In this paper a GRASP algorithm hybridized with a composite local search and path-relinking is proposed to solve the linear ordering problem with cumulative costs. Our approach consists on adding a composite local search that helps to produce diverse good solutions and improve them trough a truncated path-relinking with local search. The computational results show that the GRASP algorithm finds...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Computers & OR

دوره 40  شماره 

صفحات  -

تاریخ انتشار 2013